@Article{ChavesSennYana:2012:NoHePr,
               author = "Chaves, Antonio Augusto and Senne, Edson Luiz Fran{\c{c}}a and 
                         Yanasse, Horacio Hideki",
          affiliation = "Instituto de Ci{\^e}ncia e Tecnologia - ICT, Universidade Federal 
                         de S{\~a}o Paulo - UNIFESP, Rua Talim, 330, CEP 12231-280, 
                         S{\~a}o Jos{\'e} dos Campos, SP, Brazil and Universidade 
                         Estadual Paulista - UNESP, Av. Ariberto Pereira da Cunha, 333, CEP 
                         12516-410, Guaratinguet{\'a}, SP, Brazil and {Instituto Nacional 
                         de Pesquisas Espaciais (INPE)}",
                title = "Uma nova heur{\'{\i}}stica para o problema de 
                         minimiza{\c{c}}{\~a}o de trocas de ferramentas",
              journal = "Gest{\~a}o \& Produ{\c{c}}{\~a}o",
                 year = "2012",
               volume = "19",
               number = "1",
                pages = "17--30",
             keywords = "Graph, Heuristic, Metaheuristic, Scheduling, Tool switches, 
                         problema de sequenciamento, minimiza{\c{c}}{\~a}o de trocas de 
                         ferramentas, Heuristicas, metaheur{\'{\i}}sticas.",
             abstract = "The minimization of tool switches problem (MTSP) seeks a sequence 
                         to process a set of jobs so that the number of tool switches 
                         required is minimized. This study presents a new heuristic for the 
                         MTSP. This heuristic has two phases: a constructive phase, based 
                         on a graph where the vertices correspond to tools and there is an 
                         arc k = (i, j) linking vertices i and j if and only if the tools i 
                         and j are required to execute some job; and an improvement phase, 
                         based on an Iterated Local Search. Computational results show that 
                         the proposed heuristic has a good performance on the instances 
                         tested contributing to a significant reduction in the number of 
                         nodes generated by an enumerative algorithm.",
                 issn = "0104-530X",
                label = "lattes: 6187221670775160 3 ChavesSennYana:2012:NoHePr",
             language = "pt",
           targetfile = "a02v19n1.pdf",
        urlaccessdate = "30 abr. 2024"
}